منابع مشابه
Spectral Clustering with Links and Attributes
If relational data contain communities—groups of inter-related items with similar attribute values—a clustering technique that considers attribute information and the structure of relations simultaneously should produce more meaningful clusters than those produced by considering attributes alone. We investigate this hypothesis in the context of a spectral graph partitioning technique, consideri...
متن کاملLexical and semantic clustering by Web links
Recent Web searching and mining tools are combining text and link analysis to improve ranking and crawling algorithms. The central assumption behind such approaches is that there is a correlation between the graph structure of the Web and the text and meaning of pages. Here I formalize and quantitatively validate two conjectures drawing connections from linkage information to lexical and semant...
متن کاملLinks: A High-Dimensional Online Clustering Method
We present a novel algorithm, called Links, designed to perform online clustering on unit vectors in a high-dimensional Euclidean space. The algorithm is appropriate when it is necessary to cluster data efficiently as it streams in, and is to be contrasted with traditional batch clustering algorithms that have access to all data at once. For example, Links has been successfully applied to embed...
متن کاملCsi1 links centromeres to the nuclear envelope for centromere clustering
In the fission yeast Schizosaccharomyces pombe, the centromeres of each chromosome are clustered together and attached to the nuclear envelope near the site of the spindle pole body during interphase. The mechanism and functional importance of this arrangement of chromosomes are poorly understood. In this paper, we identified a novel nuclear protein, Csi1, that localized to the site of centrome...
متن کاملHow to Round Subspaces: A New Spectral Clustering Algorithm
A basic problem in spectral clustering is the following. If a solution obtained from the spectral relaxation is close to an integral solution, is it possible to find this integral solution even though they might be in completely different basis? In this paper, we propose a new spectral clustering algorithm. It can recover a k-partition such that the subspace corresponding to the span of its ind...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Genome Biology
سال: 2003
ISSN: 1465-6906
DOI: 10.1186/gb-spotlight-20031208-01